TCBR-HMM: An HMM-based text classifier with a CBR system

This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency.     

Study on the non-uniform contact during ELID groove grinding

This paper introduces the potential feasibility that ELID (electrolytic in-process dressing) grinding replaces superfinishing in bearing manufacturing, but ELID grinding will bring new challenges. Different regions present distinguish surface profile due to the non-uniform contact in ELID groove grinding. However, few reports explaining the non-uniform contact are available. This article explores the mechanisms of the non-uniform contact during ELID groove grinding. Experiments on the non-uniform contact between bearing raceway and grinding wheel have been carried out under different conditions. The results show that non-uniform contact exists in ELID groove grinding process and it exerts influence on the profile of the raceway surface. Non-uniform contact influences the Rsk and Rku value all the time, but it influences the Ra value occasionally. Improvement strategies of eliminating the non-uniform contact are also discussed based on the experimental study.     

ECG heart beat classification method based on modified ABC algorithm

Electrocardiogram is the most commonly used tool for the diagnosis of cardiologic diseases. In order to help cardiologists to diagnose the arrhythmias automatically, new methods for automated, computer aided ECG analysis are being developed. In this paper, a Modified Artificial Bee Colony (MABC) algorithm for ECG heart beat classification is introduced. It is applied to ECG data set which is obtained from MITBIH database and the result of MABC is compared with seventeen other classifier's accuracy.In classification problem, some features have higher distinctiveness than others. In this study, in order to find higher distinctive features, a detailed analysis has been done on time domain features. By using the right features in MABC algorithm, high classification success rate (99.30%) is obtained. Other methods generally have high classification accuracy on examined data set, but they have relatively low or even poor sensitivities for some beat types. Different data sets, unbalanced sample numbers in different classes have effect on classification result. When a balanced data set is used, MABC provided the best result as 97.96% among all classifiers.Not only part of the records from examined MITBIH database, but also all data from selected records are used to be able to use developed algorithm on a real time system in the future by using additional software modules and making adaptation on a specific hardware.     

Spatially constrained sparse coding scheme for natural scene categorization

Coding and pooling, the major two sequential procedures in sparse coding based scene categorization systems, have drawn much attention in recent years. Yet improvements have been made for coding or pooling separately, this paper proposes a spatially constrained scheme for sparse coding on both steps. Specifically, we employ the m-nearest neighbors of a local feature in the image space to improve the consistency of coding. The benefit is that similar image features will be encoded with similar codewords, which reduced the stochasticity of a conventional coding strategy. We also show that the Viola–Jones algorithm, which is well-known in face detection, can be tailored to learning receptive fields, embedding the spatially constrained information on the pooling step. Extensive experiments on the UIUC sport event, 15 natural scenes and the Caltech 101 database suggests that scene categorization performance of several popular algorithms can be ubiquitously improved by incorporating the proposed two spatially constrained sparse coding scheme.     

A New Optimized Wrapper Gene Selection Method for Breast Cancer Prediction

Machine-learning algorithms have been widely used in breast cancer diagnosis to help pathologists and physicians in the decision-making process. However, the high dimensionality of genetic data makes the classification process a challenging task. In this paper, we propose a new optimized wrapper gene selection method that is based on a nature-inspired algorithm (simulated annealing (SA)), which will help select the most informative genes for breast cancer prediction. These optimal genes will then be used to train the classifier to improve its accuracy and efficiency. Three supervised machine-learning algorithms, namely, the support vector machine, the decision tree, and the random forest were used to create the classifier models that will help to predict breast cancer. Two different experiments were conducted using three datasets: Gene expression (GE), deoxyribonucleic acid (DNA) methylation, and a combination of the two. Six measures were used to evaluate the performance of the proposed algorithm, which include the following: Accuracy, precision, recall, specificity, area under the curve (AUC), and execution time. The effectiveness of the proposed classifiers was evaluated through comprehensive experiments. The results demonstrated that our approach outperformed the conventional classifiers as expected in terms of accuracy and execution time. High accuracy values of 99.77%, 99.45%, and 99.45% have been achieved by SA-SVM for GE, DNA methylation, and the combined datasets, respectively. The execution time of the proposed approach was significantly reduced, in comparison to that of the traditional classifiers and the best execution time has been reached by SA-SVM, which was 0.02, 0.03, and 0.02 on GE, DNA methylation, and the combined datasets respectively. In regard to precision and specificity, SA-RF obtained the best result of 100 on GE dataset. While SA-SVM attained the best recall result of 100 on GE dataset.     

An E-Business Event Stream Mechanism for Improving User Tracing Processes

With the rapid development in business transactions, especially in recent years, it has become necessary to develop different mechanisms to trace business user records in web server log in an efficient way. Online business transactions have increased, especially when the user or customer cannot obtain the required service. For example, with the spread of the epidemic Coronavirus (COVID-19) throughout the world, there is a dire need to rely more on online business processes. In order to improve the efficiency and performance of E-business structure, a web server log must be well utilized to have the ability to trace and record infinite user transactions. This paper proposes an event stream mechanism based on formula patterns to enhance business processes and record all user activities in a structured log file. Each user activity is recorded with a set of tracing parameters that can predict the behavior of the user in business operations. The experimental results are conducted by applying clustering-based classification algorithms on two different datasets; namely, Online Shoppers Purchasing Intention and Instacart Market Basket Analysis. The clustering process is used to group related objects into the same cluster, then the classification process measures the predicted classes of clustered objects. The experimental results record provable accuracy in predicting user preferences on both datasets.     

基于多元Taylor级数和AFS的混合定位算法

针对传统Taylor级数定位算法存在精度严重依赖初始值,导致定位精确度不高的缺陷,结合人工鱼群算法和多元Taylor级数展开算法的优点,提出了一种基于人工鱼群算法初值选取与多元Taylor级数展开算法精确求解的混合定位方法。算法充分发挥了人工鱼群算法初值估计性能良好和多元Taylor级数展开算法求解精度高的优点。仿真结果表明:上述算法减少了鱼群数目和迭代次数的选取对定位精度的影响,混合定位算法的精度更高。     

带权决策表的属性约简

属性约简是粗糙集理论的重要应用。考虑将决策表中的每行都作为一条决策规则时，若把表中出现相同决策规则的次数作为权，可得到带权决策表。提出了关于带权决策表的正域约简相应的辨识矩阵并给出了证明，从而得到了约简算法。相比于决策表中的正域约简时发现，通过将决策表转化为带权决策表后，再利用算法1进行约简时，其在一定程度上优于前者。提出了近似分类精度约简相应的辨识矩阵并给出了证明。对于2个算法，在选取的UCI数据集上进行了实验验证。通过实验进一步说明了所提出算法的可行性和有效性。